1. Arithmetic, Proof theory and computational complexity
پدیدآورنده : edited by Peter Clote and Jan Krajicek
کتابخانه: Library of Institute for Research in Fundamental Sciences (Tehran)
موضوع : ، Proof theory,، Computational complexity
رده :
QA
9
.
54
.
A75
2. Bounded arithmetic, propositional logic, and complexity theory
پدیدآورنده : / Jan Krajicek
کتابخانه: Central Library and Document Center of Shahid Chamran University (Khuzestan)
موضوع : Constructive mathematics.,Proposition (Logic),Computational complexity.
رده :
QA
,
9
.
56
,.
K73
,
1995
3. Bounded arithmetic, propositional logic, and complexity theory
پدیدآورنده : Krajicek, Jan
کتابخانه: Library of Institute for Research in Fundamental Sciences (Tehran)
موضوع : ، Constructive mathematics,، Proposition )Logic(,، Computational complexity
رده :
QA
9
.
56
.
K7
4. Forcing with random variables and proof complexity
پدیدآورنده : Krajicek, Jan
کتابخانه: Library of Institute for Research in Fundamental Sciences (Tehran)
موضوع : ، Computational complexity,، Random variables,، Mathematical analysis
رده :
QA
267
.
7
.
K72F6
